Combined Partitioning Hardware-Software Algorithms
نویسندگان
چکیده
منابع مشابه
Combined Partitioning Hardware-Software Algorithms
In recent years, meta-heuristics have become increasingly interesting in solving combinatorial problems including hardware-software partitioning. In this paper, we present a comparative study between some algorithms which involve meta-heuristics based on Tabu search, genetic algorithm and Binary Search Trees to address the problem of hardware-software partitioning. In fact, meta-heuristics can ...
متن کاملAlgorithms for High Performance Hardware Software Partitioning
Designing embedded systems efficiently has always been of significant interest. This is primarily motivated by the fact that these embedded systems find application in a wide range of fields: industrial automation, commercial electronics, scientific and medical applications, and many more. With the inherent drive towards automation in today’s world, these applications are only ever-increasing. ...
متن کاملHierarchical Hardware/Software Partitioning
In this paper, we present a hierarchical evolutionary approach to hardware/software partitioning for real-time embedded systems. In contrast to most of previous approaches which employ a single granularity for tasks and hardware modules, we use hierarchical models and dynamically determine the granularity of tasks and hardware modules to adaptively optimize the solution while keeping the search...
متن کاملHardware/Software Partitioning and Scheduling Algorithms for Dynamically Reconfigurable Architectures
The use of dynamically reconfigurable logic (DRL) in the design of embedded systems has added a new dimension to the hardware/software co-synthesis problem. The spatial computing advantage and silicon reuse offered by DRL comes at the cost of reconfiguration latency which has to be effectively managed in order to optimize the system performance and power consumption. The initial attempts at lev...
متن کاملAlgorithms for bi-objective multiple-choice hardware/software partitioning
This paper proposes three algorithms for multiple-choice hardware-software partitioning with the objectives: minimizing execution time and power consumption, while meeting the area constraint. A heuristic algorithm is proposed to rapidly generate an approximate solution. A tabu search algorithm is customized to refine the heuristic solution. Also, a dynamic programming algorithm is proposed to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/21054-3701